Real-Time Sequential Convex Programming for Optimal Control Applications
نویسندگان
چکیده
This paper proposes real-time sequential convex programming (RTSCP), a method for solving a sequence of nonlinear optimization problems depending on an online parameter. We provide a contraction estimate for the proposed method and, as a byproduct, a new proof of the local convergence of sequential convex programming. The approach is illustrated by an example where RTSCP is applied to nonlinear model predictive control.
منابع مشابه
A numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملModel Predictive Control of Swarms of Spacecraft Using Sequential Convex Programming
This paper presents a decentralized, model predictive control algorithm for the optimal guidance and reconfiguration of swarms of spacecraft composed of hundreds to thousands of agents with limited capabilities. In previous work,J2-invariant orbits have been found to provide collision-freemotion for hundreds of orbits in a lowEarth orbit. This paper develops real-time optimal control algorithms...
متن کاملAas 13-439 Decentralized Model Predictive Control of Swarms of Spacecraft Using Sequential Convex Programming
This paper presents a decentralized, model predictive control algorithm for the reconfiguration of swarms of spacecraft composed of hundreds to thousands of agents with limited capabilities. In our prior work, sequential convex programming has been used to determine collision-free, fuel-efficient trajectories for the reconfiguration of spacecraft swarms. This paper uses a model predictive contr...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملA Novel Coordinate Transformation for Obstacle Avoidance and Optimal Trajectory Planning
This paper presents a sequential optimization technique for the design of optimal trajectories while minimizing a cost index subject to system dynamics, path and actuation constraints. A novel coordinate transformation is introduced to cast the non-convex trajectory generation problem as a convex optimization problem. A sequential linear programming approach is discussed to solve the resulting ...
متن کامل